Pii: S0140-3664(00)00196-1

نویسندگان

  • C. Vijayanand
  • M. Shiva Kumar
  • K. R. Venugopal
  • P. Sreenivasa Kumar
چکیده

Wavelength routed optical networks have emerged as a technology that can effectively utilize the enormous bandwidth of the optical ®ber. Wavelength converters play an important role in enhancing the ®ber utilization and reducing the overall call blocking probability of the network. Placement of wavelength converters is an NP-complete problem (K.C. Lee, V.O.K. Li, IEEE Journal of Lightwave Technology 11(5/6) (1993) 962±970) in an arbitrary mesh network. In this paper, new Integer Linear Program (ILP) formulations have been proposed for the static and dynamic routing and wavelength assignment problem to reduce the number of conversions. We use Genetic Algorithms (GAs) for placing limited range wavelength converters in arbitrary mesh wavelength routed optical networks. The objective is to achieve near optimal placement of full and limited range wavelength converters resulting in reduced blocking probabilities and low distortion of the optical signal. Certain heuristics are used to obtain starting solutions for the GAs to enable it to converge faster. The results obtained using GAs are compared with the heuristic method of placement. We study the range of loads for which converters are useful. We observe that limited range converters placed near optimally at a few nodes can provide almost the same blocking probability as full range wavelength converters placed at all the nodes and that increasing the number of converters yields only a marginal improvement in blocking probability. We also observe that uniform placement of converters can be adopted in ring networks at low offered loads. We study the effect of uniform placement at higher loads and suggest that when used with reservation in the routing algorithm, converters ensure fairness to all nodes. Simulations have been carried out on a 12-node ring network and 14-node NSFNET. q 2000 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pii: S0140-3664(99)00196-6

We propose a simple distance-vector protocol for routing in networks having unidirectional links. The protocol can be seen as an adaptation for these networks of the strategy as used in the popular RIP protocol. The protocol comprises two main algorithms, one for collecting “from” information, and the other one for generating and propagating “to” information. Like the RIP protocol, this one can...

متن کامل

A distance-vector routing protocol for networks with unidirectional links

We propose a simple distance vector protocol for routing in networks having unidirectional links The protocol can be seen as an adaptation for these networks of the strategy as used in the popular RIP protocol The protocol comprises two main algorithms one for collecting from information and the other one for generating and propagating to information Like the RIP protocol this one can handle dy...

متن کامل

Pii: S0140-3664(00)00246-2

Secure communication over the Internet becomes an essential requirement for any value-added Internet application. The use of cryptography for secure communication brings out the requirement of cryptographic key management. This paper examines some security issues on the Internet Key Exchange (IKE) protocol specified in RFC 2409. The investigation is intended for clarifying some specification am...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000